Structure of linear codes over the ring Bk
نویسندگان
چکیده
We study the structure of linear codes over the ring Bk which is defined by Fpr [v1, v2, . . . , vk]/〈v 2 i = vi, viv j = v jvi〉 k i, j=1. In order to study the codes, we begin with studying the structure of the ring Bk via a Gray map which also induces a relation between codes over Bk and codes over Fpr . We consider Euclidean and Hermitian self-dual codes, MacWilliams relations, as well as Singleton-type bounds for these codes. Further, we characterize cyclic and quasi-cyclic codes using their images under the Gray map, and give the generators for these type of codes.
منابع مشابه
Constacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملCodes over an infinite family of algebras
In this paper, we will show some properties of codes over the ring Bk = Fp[v1, . . . , vk]/(v i = vi, ∀i = 1, . . . , k). These rings, form a family of commutative algebras over finite field Fp. We first discuss about the form of maximal ideals and characterization of automorphisms for the ring Bk. Then, we define certain Gray map which can be used to give a connection between codes over Bk and...
متن کاملComputation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کامل2-D skew constacyclic codes over R[x, y; ρ, θ]
For a finite field $mathbb{F}_q$, the bivariate skew polynomial ring $mathbb{F}_q[x,y;rho,theta]$ has been used to study codes cite{XH}. In this paper, we give some characterizations of the ring $R[x,y;rho,theta]$, where $R$ is a commutative ring. We investigate 2-D skew $(lambda_1,lambda_2)$-constacyclic codes in the ring $R[x,y;rho,theta]/langle x^l-lambda_1,y^s-lambda_2rangle_{mathit{l}}.$ A...
متن کاملOn Skew Cyclic Codes over a Finite Ring
In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1710.03403 شماره
صفحات -
تاریخ انتشار 2017